Scenario Tree Generation by Clustering the Simulated Data Paths

نویسندگان

  • Henrikas Pranevicius
  • Kristina Sutiene
چکیده

Multistage stochastic programs are effective for solving long-term planning problems under uncertainty. Such programs are usually based on a scenario model of future environment developments. A good approximation of the underlying stochastic process may involve a very large number of scenarios and their probabilities. We discuss the case when enough data paths can be generated, but due to solvability of stochastic program the scenario tree has to be constructed. The proposed strategy is to generate the multistage scenario tree from the set of individual scenarios by bundling scenarios based on cluster analysis. The K-means clustering approach is modified to capture the interstage dependencies in order to model the sequential decisions. The described scenario tree generation method is implemented on sampled data of nominal interest rate.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scenario Generation Employing Copulas

stochastic programs are effective for solving long-term planning problems under uncertainty. Such programs are usually based on scenario generation model about future environment developments. In the present paper, the scenario model is developed for the case when enough data paths can be generated, but due to solvability of stochastic program the scenario tree has to be constructed. The propos...

متن کامل

Multistage K-Means Clustering for Scenario Tree Construction

In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in the form of scenario tree. This paper presents the approach to generate the multistage multidimensional scenario tree out of a set of scenario fans. For this purpose, the multistage K-means clustering algorithm is developed. The ...

متن کامل

Stochastic Extensions to FlopC++

We extend the open-source modelling language FlopC++, which is part of the COIN-OR project, to support multi-stage stochastic programs with recourse. We connect the stochastic version of FlopC++ to the existing COIN class stochastic modelling interface (SMI) to provide a direct interface to specialized solution algorithms. The new stochastic version of FlopC++ can be used to specify scenariobas...

متن کامل

Clustering of Short Read Sequences for de novo Transcriptome Assembly

Given the importance of transcriptome analysis in various biological studies and considering thevast amount of whole transcriptome sequencing data, it seems necessary to develop analgorithm to assemble transcriptome data. In this study we propose an algorithm fortranscriptome assembly in the absence of a reference genome. First, the contiguous sequencesare generated using de Bruijn graph with d...

متن کامل

Stochastic Joint Optimal Distributed Generation Scheduling and Distribution Feeder Reconfiguration of Microgrids Considering Uncertainties Modeled by Copula-Based Method

Using distributed generations (DGs) with optimal scheduling and optimal distribution feeder reconfiguration (DFR) are two aspects that can improve efficiency as well as technical and economic features of microgrids (MGs). This work presents a stochastic copula scenario-based framework to jointly carry out optimal scheduling of DGs and DFR. This framework takes into account non-dispatchable and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007